On 2-coloring certain k-uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Equitable Coloring of k-Uniform Hypergraphs
Let H be a k-uniform hypergraph with n vertices. A strong r-coloring is a partition of the vertices into r parts, such that each edge of H intersects each part. A strong r-coloring is called equitable if the size of each part is dn/re or bn/rc. We prove that for all a ≥ 1, if the maximum degree of H satisfies ∆(H) ≤ k then H has an equitable coloring with k a ln k (1 − ok(1)) parts. In particul...
متن کاملColoring d-Embeddable k-Uniform Hypergraphs
This paper extends the scenario of the Four Color Theorem in the following way. LetHd,k be the set of all k-uniform hypergraphs that can be (linearly) embedded into Rd . We investigate lower and upper bounds on the maximum (weak and strong) chromatic number of hypergraphs in Hd,k. For example, we can prove that for d ≥ 3 there are hypergraphs inH2d−3,d on n vertices whose weak chromatic number ...
متن کاملStreaming Algorithms for 2-Coloring Uniform Hypergraphs
We consider the problem of two-coloring n-uniform hypergraphs. It is known that any such hypergraph with at most 1 10 √
متن کاملApproximate coloring of uniform hypergraphs
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of finding the exact value of the chromatic number of a hypergraph is known to be NP-hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-un...
متن کاملColoring uniform hypergraphs with few colors
Let m(r, k) denote the minimum number of edges in an r-uniform hypergraph that is not k-colorable. We give a new lower bound on m(r, k) for fixed k and large r. Namely, we prove that if k 2, then m(r, k) (k)k(r/ln r) . © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 24: 1–10, 2004
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2003
ISSN: 0097-3165
DOI: 10.1016/s0097-3165(02)00024-9